Exemplar Longest Common Subsequence
نویسندگان
چکیده
منابع مشابه
Repetition-free longest common subsequence
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a complexity result, and we describe a preliminary experimental study based on the proposed algorithms.
متن کاملThe Longest Common Subsequence Problem
Algorithms on sequences of symbols have been studied for a long time and now form a fundamental part of computer science. One of the very important problems in analysis of sequences is the longest common subsequence problem. For the general case of an arbitrary number of input sequences, the problem is NP-hard. We describe an approach to solve this problem. This approach is based on constructin...
متن کاملOn the Constrained Longest Common Subsequence Problem
The problem of the longest common subsequence is a classical distance measure for strings. There have been several attempts to accommodate longest common subsequences along with some other distance measures. There are a large number of different variants of the problem. In this paper, we consider the constrained longest common subsequence problem for two strings and arbitrary number of constrai...
متن کاملThe constrained longest common subsequence problem
This paper considers a constrained version of longest common subsequence problem for two strings. Given strings S1, S2 and P , the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S2 such that P is a subsequence of this lcs. An O(rn 2m2) time algorithm based upon the dynamic programming technique is proposed for...
متن کاملComputing a Longest Common Palindromic Subsequence
The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science. Palindrome is a word which reads the same forward as it does backward. The longest common palindromic subsequence (LCPS) problem is a variant of the classic LCS problem which finds a longest common subsequence between two given strings such that the computed subsequence is also a palindrome. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics
سال: 2007
ISSN: 1545-5963,1557-9964,2374-0043
DOI: 10.1109/tcbb.2007.1066